Harmonic is 3-Competitive for Two Servers
نویسندگان
چکیده
We consider the server algorithm, called HARMONIC, that always moves the servers with probabilities proportional to the inverses of distances to the request point. We show that for two servers HARMONIC is 3-competitive. Before it was only known that the competitiveness constant of this algorithm is between 3 and 6.
منابع مشابه
A Simple Analysis of the HarmonicAlgorithm for Two
HARMONIC is a randomized k-server algorithm that chooses the servers with probabilities proportional to the inverses of distances to the request point. We present a simple proof that HARMONIC is 3-competitive for k = 2.
متن کاملThe Online Metric Matching Problem for Doubling Metrics
In the online minimum-cost metric matching problem, we are given an instance of a metric space with k servers, and must match arriving requests to as-yet-unmatched servers to minimize the total distance from the requests to their assigned servers. We study this problem for the line metric and for doubling metrics in general. We give O(log k)competitive randomized algorithms, which reduces the g...
متن کاملThe k-Server Problem with Parallel Requests and the Compound Harmonic Algorithm
In this paper the (randomized) compound Harmonic algorithm for solving the generalized k-server problem is proposed. This problem is an online k-server problem with parallel requests where several servers can also be located on one point. In 2000 Bartal and Grove have proved that the well-known Harmonic algorithm is competitive for the (usual) k-server problem. Unfortunately, certain techniques...
متن کاملGenerosity Helps, or an 11-Competitive Algorithm for Three Servers
We propose a new algorithm called Equipoise for the k-server problem, and we prove that it is 2-competitive for two servers and 11-competitive for three servers. For k = 3, this is a tremendous improvement over previously known constants. The algorithm uses several techniques for designing on-line algorithms { convex hulls, work functions and forgiveness.
متن کاملVacation model for Markov machine repair problem with two heterogeneous unreliable servers and threshold recovery
Markov model of multi-component machining system comprising two unreliable heterogeneous servers and mixed type of standby support has been studied. The repair job of broken down machines is done on the basis of bi-level threshold policy for the activation of the servers. The server returns back to render repair job when the pre-specified workload of failed machines is build up. The first (seco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 98 شماره
صفحات -
تاریخ انتشار 1992